WORST_CASE(?,O(n^2))

Solution:
---------

  "Cons" :: ["A"(0, 0) x "A"(15, 3)] -(12)-> "A"(12, 3)
  "Cons" :: ["A"(0, 0) x "A"(5, 0)] -(5)-> "A"(5, 0)
  "Cons" :: ["A"(0, 0) x "A"(12, 0)] -(12)-> "A"(12, 0)
  "Cons" :: ["A"(0, 0) x "A"(4, 2)] -(2)-> "A"(2, 2)
  "Cons" :: ["A"(0, 0) x "A"(2, 0)] -(2)-> "A"(2, 0)
  "False" :: [] -(0)-> "A"(5, 15)
  "Nil" :: [] -(0)-> "A"(12, 0)
  "Nil" :: [] -(0)-> "A"(12, 3)
  "Nil" :: [] -(0)-> "A"(5, 0)
  "Nil" :: [] -(0)-> "A"(13, 15)
  "Nil" :: [] -(0)-> "A"(14, 4)
  "True" :: [] -(0)-> "A"(0, 13)
  "app" :: ["A"(5, 0) x "A"(2, 2)] -(1)-> "A"(2, 0)
  "goal" :: ["A"(14, 15)] -(16)-> "A"(0, 0)
  "naiverev" :: ["A"(12, 3)] -(15)-> "A"(2, 0)
  "notEmpty" :: ["A"(12, 0)] -(13)-> "A"(0, 3)


Cost Free Signatures:
---------------------

  "Cons" :: ["A"_cf(0, 0) x "A"_cf(3, 0)] -(3)-> "A"_cf(3, 0)
  "Cons" :: ["A"_cf(0, 0) x "A"_cf(10, 7)] -(3)-> "A"_cf(3, 7)
  "Cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "Nil" :: [] -(0)-> "A"_cf(3, 0)
  "Nil" :: [] -(0)-> "A"_cf(15, 15)
  "Nil" :: [] -(0)-> "A"_cf(15, 12)
  "Nil" :: [] -(0)-> "A"_cf(0, 0)
  "app" :: ["A"_cf(3, 0) x "A"_cf(3, 4)] -(0)-> "A"_cf(3, 0)
  "app" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "naiverev" :: ["A"_cf(3, 0)] -(0)-> "A"_cf(3, 0)


Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"Cons\"_A" :: ["A"(0, 0) x "A"(1, 1)] -(0)-> "A"(0, 1)
  "\"False\"_A" :: [] -(0)-> "A"(1, 0)
  "\"False\"_A" :: [] -(0)-> "A"(0, 1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1, 0)
  "\"Nil\"_A" :: [] -(0)-> "A"(0, 1)
  "\"True\"_A" :: [] -(1)-> "A"(1, 0)
  "\"True\"_A" :: [] -(0)-> "A"(0, 1)